منابع مشابه
A Survey of Elementary Object Systems Part I: Decidability Results
This contribution presents the formalism of Elementary Object Systems (Eos). Object nets are Petri nets which have Petri nets as tokens – an approach known as the nets-within-nets paradigm. Since object nets in general are immediately Turing complete, we introduce the restricted class of elementary object nets which restrict the nesting of nets to the depth of two. In this work we study the rel...
متن کاملElementary Modal Logics – Decidability and Complexity
Modal logic was first introduced by philosophers to study the deductive behaviour of the expressions it is necessary that and it is possible that. Nowadays, it is widely used in several areas of computer science, including formal verification and artificial intelligence. Syntactically, modal logic extends propositional logic by two unary operators: ♦ and . The formal semantics is usually given ...
متن کاملA Survey of Decidability Results for Elementary Object Systems
This contribution presents the formalism of Elementary Object Systems (Eos). Object nets are Petri nets which have Petri nets as tokens – an approach known as the nets-within-nets paradigm. Since object nets in general are immediately Turing complete, we introduce the restricted class of elementary object nets which restrict the nesting of nets to the depth of two. One central aim of this contr...
متن کاملSome new results on decidability for elementary algebra and geometry
We carry out a systematic study of decidability for theories of (a) real vector spaces, inner product spaces, and Hilbert spaces and (b) normed spaces, Banach spaces and metric spaces, all formalised using a 2-sorted first-order language. The theories for list (a) turn out to be decidable while the theories for list (b) are not even arithmetical: the theory of 2-dimensional Banach spaces, for e...
متن کاملNumber-conserving cellular automata I: decidability
We prove that de6nitions of number-conserving cellular automata found in literature are equivalent. A necessary and su9cient condition for cellular automata to be number-conserving is proved. Using this condition, we give a quasi-linear time algorithm to decide number-conservation. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1989
ISSN: 0001-8708
DOI: 10.1016/0001-8708(89)90044-3